Statistical testing procedure for lengths of formalized proofs

نویسنده

  • Ivan Kramosil
چکیده

Institute of Mathematics of the Academy of Sciences of the Czech Republic provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use. This paper has been digitized, optimized for electronic delivery and stamped with digital signature within the project DML-CZ: The Czech Digital Mathematics Library A statistical testing procedure is proposed, which enables to test, given a formula of a formalized theory, whether there exists a proof of this formula the length of which does not exceed an a priori given threshold value. Such a decision rule may be of great importance when applied to automated problem solving as it prevents us from looking for solutions which are inappropriate from applicational points of view.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Proof of FDR Control Based on Forward Filtration

For multiple testing problems, Benjamini and Hochberg (1995) proposed the false discovery rate (FDR) as an alternative to the family-wise error rate (FWER). Since then, researchers have provided many proofs to control the FDR under different assumptions. Storey et al. (2004) showed that the rejection threshold of a BH step-up procedure is a stopping time with respect to the reverse filtration g...

متن کامل

Intersecting Chords Theorem

This entry provides a geometric proof of the intersecting chords theorem. The theorem states that when two chords intersect each other inside a circle, the products of their segments are equal. After a short review of existing proofs in the literature [1, 3–5], I decided to use a proof approach that employs reasoning about lengths of line segments, the orthogonality of two lines and Pythagoras ...

متن کامل

Formalizing Forcing Arguments in Subsystems of Second-Order Arithmetic

We show that certain model-theoretic forcing arguments involving subsystems of second-order arithmetic can be formalized in the base theory, thereby converting them to effective proof-theoretic arguments. We use this method to sharpen conservation theorems of Harrington and Brown-Simpson, giving an effective proof that WKL+0 is conservative over RCA0 with no significant increase in the lengths ...

متن کامل

Certification of Nontermination Proofs

Automatic tools for proving (non)termination of term rewrite systems, if successful, deliver proofs as justification. In this work, we focus on how to certify nontermination proofs. Besides some techniques that allow to reduce the number of rules, the main way of showing nontermination is to find a loop, a finite derivation of a special shape that implies nontermination. For standard terminatio...

متن کامل

Reusing Formal Proofs Through Isomorphisms Invited Talk

ABSTRACT Formalization of computational objects, software and hardware, is the unique manner to guarantee well-behavior of computer programs and hardware, at least from the mathematical and logical point of view. Several verification and testing approaches have been proved of great applicability in this area being their usability made evident through real applications in the development of crit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Kybernetika

دوره 16  شماره 

صفحات  -

تاریخ انتشار 1980